Centralized Hierarchical Routing to minimize Propagation Delay in Wireless Sensor Networks

WSNs is a collection of wireless nodes with limited energy capabilities that may be mobile or stationary and are located randomly on a dynamically changing environment. The routing strategies selection is an important issue for the efficient delivery of the packets to their destination. Moreover, in such networks, the applied routing strategy should ensure the minimum of the energy consumption and hence maximization of the lifetime of the network. Hierarchical routing architecture divides the whole network in to a group of cluster and only cluster head is responsible to forwarding the data to base station directly or via other cluster heads. During the creation of network topology, the process of setting up routes in WSNs is usually influenced by energy considerations, because the power consumption of a wireless link is proportional to square or even higher order of the distance between the sender and the receiver. Hierarchical routing can be centralized or noncentralized. In non-centralized hierarchical routing, the sensor nodes self-configures for the cluster head on the basis of selecting a random number. They don’t consider the case of residual energy. But in centralized routing the base station is responsible to create cluster. In hierarchical routing architecture, sensor nodes self-configure themselves for the formation of cluster heads. The proposed work is to design a routing protocol which is energy efficient and reduce propagation delay. The results are compared with HEED routing protocol which is also a hierarchical routing protocol.